A decomposition algorithm for network reliability evaluation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Decomposition Algorithm for Network Reliability Evaluation

This paper presents an algorithm for computing the K-terminal reliability of undirected networks, i.e. the probability that a given set of vertices in the network are connected. when edges and nodes fail independently with known probabilities. This algorithm is based on a decomposition method introduced by Rosenthal. It consists in numbering the vertices of the graph so that the successive boun...

متن کامل

An Improved Algorithm for Network Reliability Evaluation

Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...

متن کامل

an improved algorithm for network reliability evaluation

binary decision diagram (bdd) is a data structure proved to be compact in representation and efficient in manipulation of boolean formulas. using binary decision diagram in network reliability analysis has already been investigated by some researchers. in this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using cudd - colorado univer...

متن کامل

A Monte Carlo Algorithm Based on a State-space Decomposition Methodology for Flow Network Reliability Evaluation

The exact evaluation of the probability that the maximum stow is greater than or equal to a xed value d in a stochastic ow network is an NP-hard problem. This limitation leads to consider Monte Carlo alternatives. In this paper, we show how to exploit the state-space decomposition methodology of Doulliez and Jamoulle for deriving a Monte Carlo simulation algorithm. We show that the resulting Mo...

متن کامل

A Modified Benders Decomposition Algorithm for Supply Chain Network Design under Risk Consideration

In today’s competitive business environment, the design and management of supply chainnetwork is one of the most important challenges that managers encounter. The supply chain network shouldbe designed for satisfying of customer demands as well as minizing the total system costs. This paper presentsa multi-period multi-stage supply chain network design problem under demand uncertainty. The prob...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 1996

ISSN: 0166-218X

DOI: 10.1016/0166-218x(95)00032-m